Detecting induced subdivision of K4
نویسنده
چکیده
In this paper, we propose a polynomial-time algorithm to test whether a given graph contains a subdivision of K 4 as an induced subgraph.
منابع مشابه
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K4 are 3-colorable. This proves a conjecture of Trotignon and Vušković [5]. ∗Supported by NSF grant DMS-1550991 and US Army Research Office Grant W911NF16-1-0404. †Partially supported by ANR project Stint under reference ANR-13-BS02-0007 and by the LABEX MILYON (ANR-10-LABX-0070) of Universi...
متن کاملA new result on chromaticity of K4-homoemorphs with girth 9
For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...
متن کاملOn Chromatic Uniqueness And Equivalence of K4-Homeomorphic Graphs
A K4-homeomorph is a subdivision of the complete graph with four vertices (K4). Such a homeomorph is denoted by K4(a,b,c,d,e,f) if the six edges of K4 are replaced by the six paths of length a,b,c,d,e,f, respectively. In this paper, we discuss the chromaticity of a family of K4-homeomorphs with girth 10. We also give sufficient and necessary condition for some graphs in the family to be chromat...
متن کاملChromatic number of ISK4-free graphs
A graph G is said to be ISK4-free if it does not contain any subdivision of K4 as an induced subgraph. In this paper, we propose new upper bounds for chromatic number of ISK4-free graphs and {ISK4, triangle}-free graphs.
متن کاملEven Pairs and Prism Corners in Square-Free Berge Graphs
Let G be a Berge graph such that no induced subgraph is a 4-cycle or a line-graph of a bipartite subdivision of K4. We show that every such graph G either is a complete graph or has an even pair.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.04637 شماره
صفحات -
تاریخ انتشار 2017